Modification Interior-Point Method for Solving Interval Linear Programming

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interior Point Method for Solving Fuzzy Number Linear Programming Problems Using Linear Ranking Function

Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplexmethod. But their computational complexities are exponential, which is not satisfactory for solving largescale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programmi...

متن کامل

An interior-point piecewise linear penalty method for nonlinear programming

We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an `2-penalty function. The PLPF is defined by a set of penalty parameters that correspond to break points of the PLPF and are updated at every iteration. The `2-penalty function, like traditional penalty functions for NLP, is defined b...

متن کامل

Solving symmetric indefinite systems in an interior-point method for linear programming

Received 28 January 1992 Revised manuscript received 27 October 1992 This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday. We describe an implementation of a primal-dual path following method for linear programming that solves symmetric indefinite "augmented" systems directly by Bunch-Parlett factorization, rather than reducing these systems to the positive definite "norma...

متن کامل

A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints

Most research on bilevel linear programming problem  is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...

متن کامل

Providing a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach

Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in computer science research

سال: 2022

ISSN: ['2352-538X']

DOI: https://doi.org/10.2991/acsr.k.220202.019